The Polygon Exploration Problem II: The Angle Hull
نویسندگان
چکیده
Let D be a connected region inside a simple polygon, P . We define the angle hull of D, AH(D), to be the set of all points in P that can see two points of D at a right angle. We show that the perimeter of AH(D) cannot exceed in length the perimeter of D by more than a factor of 2. This upper bound is tight. Our result can be generalized to angles different from 90◦, and to settings where region D is surrounded by obstacles other than a simple polygon.
منابع مشابه
The Polygon Exploration Problem I: A Competitive Strategy
We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed off-line. Our analysis is doubly founded on a novel geometric structure called the angle hull. This structure is presented in Part II of this paper [13].
متن کاملThe Polygon Exploration Problem
We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed off-line. Our analysis is doubly founded on a novel geometric structure called the angle hull. Let D be a connected region inside a simple polygon, P . We define the angl...
متن کاملOn the Number of Guards in Sculpture Garden Problem
In this paper, we consider the problem of placing a small number of angle guards inside a simple polygon P such that each point in the plane can determine if it is in or out of P from a monotone Boolean formula (and (.) and or (+) operations only) composed from the angle guards. Each angle guard views an infinite wedge of the plane. This class of new art gallery type problems is called sculptur...
متن کاملLPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph
Finding the polygon hull in a connected Euclidean graph can be considered as the problem of finding the convex hull with the exception that at any iteration a vertex can be chosen only if it is connected to the vertex chosen at the previous iteration. One of the methods that can be used for this kind of problems is Jarvis’ algorithm which allows to find the convex hull and which must be adapted...
متن کاملFinding the Convex Hull of a Simple Polygon
The problem of finding the convex hull of a planar set of points P, that is, finding the smallest convex region enclosing P, arises frequently in computer graphics. For example, to fit P into a square or a circle, it is necessary and sufficient that H(P), the convex hull of P, fits; and since it is usually the case that H(P) has many fewer points than P has, it is a simpler object to manipulate...
متن کامل